Connected Sets and the AMS , 1901 – 1921

نویسنده

  • David E. Zitarelli
چکیده

C hapter 1 of Kelley’s famous book General Topology introduces the most fundamental concepts of a topological space. One such notion is defined as follows [1]: A topological space (X, τ) is connected if and ony if X is not the union of two nonvoid separated subsets, where A and B are separated in X if and only if A∩ B = œ and A∩ B = œ. As usual, Y denotes the closure of a subset Y of X. Kelley’s book has been a staple for several generations of graduate students, many of whom must have wondered what this formal definition had to do with their intuitive notion of a connected set. Frequently, such queries can be answered by an historical investigation, and the aim here is to trace the development of the formal concept of a connected set from its origins in 1901 until its ultimate ascension into the ranks of mathematical concepts worthy of study for their own sake twenty years later. Much of this development took place at the University of Chicago under E. H. Moore, and the evolution of connected sets exemplifies one specific way in which ideas that germinated there would be promulgated by his descendants. Although Moore exerted little direct influence, his department’s core of outstanding graduate students, like the well-known Oswald Veblen, and its cadre of small-college instructors and high school teachers from across the country who pursued degrees during summer sessions,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the local connectivity of limit sets of Kleinian groups

AMS no. 30F40 The main result here is the fact that the limit set of a geometrically finite Kleinian group with connected limit set is locally connected. For an analytically finite Kleinian group with connected limit set, we give necessary and sufficient conditions for the limit set to be locally connected.

متن کامل

Connected odd dominating sets in graphs

An odd dominating set of a simple, undirected graph G = (V,E) is a set of vertices D ⊆ V such that |N [v]∩D| ≡ 1 mod 2 for all vertices v ∈ V . It is known that every graph has an odd dominating set. In this paper we consider the concept of connected odd dominating sets. We prove that the problem of deciding if a graph has a connected odd dominating set is NP-complete. We also determine the exi...

متن کامل

Computing Connectedness: an exercise in computational topology

We reformulate the notion of connectedness for compact metric spaces in a manner that may be implemented computationally. In particular, our techniques can distinguish between sets that are connected; have a nite number of connected components; have in nitely many connected components; or are totally disconnected. We hope that this approach will prove useful for studying structures in the phase...

متن کامل

Connected and Hyperconnected Generalized Topological Spaces

A. Csaszar introduced and extensively studied the notion of generalized open sets. Following Csazar, we introduce a new notion hyperconnected. We study some specic properties about connected and hyperconnected in generalized topological spaces. Finally, we characterize the connected component in generalized topological spaces.

متن کامل

Some Properties of $(1,2)^*$-Soft\ b-Connected Spaces

In this paper we introduce the concept of $(1,2)^*$-sb-separated sets and $(1,2)^*$-soft b-connected spaces and prove some properties related to these break topics. Also we disscused the properties of $(1,2)^*$-soft b- compactness in soft bitopological space

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009